Service-level based response by assignment and order processing for warehouse automation

Along with tremendous growth of online sales in this Internet era, unprecedented intensive competition in shortening the delivery time of orders has been occurring among several major online retailers. On the other hand, the idea of customer-oriented service creates a trend of diversified pricing strategy. Different price options are offered to cater to diversified needs of customers. It has become an urgent need for online sales industries to provide the differentiated service levels for different classes of customers with different priorities based on the charging prices and resource constraints of the supply network. In response to the challenges mentioned above, this thesis focuses on providing differentiated service levels to different customers within the warehouse automation system, which is the key point of the supply network. To concentrate on the research topic, the process of a user’s order in warehouse automation system is broken down into the waiting process and retrieving process, which is related to order processing policy and storage assignment method respectively. Priority Based Turn-over Rate (PBTR) storage assignment method, Priority Based Weighted Queuing (PBWQ) policy and joint optimization of storage assignment and PBWQ policy are proposed, developed, explored and validated in this thesis. Utility function of charging price and order processing time is developed to measure the performances of the proposed methods. Compared with the classical turn over rate assignment method, PBTR has 23.21% of improvement under the measurement of utility function, when different classes of customers have different needs for products. PBWQ improves the system performance by 18.15% compared with First-Come-First-Serve (FCFS) policy under baseline setting of experiments. Joint optimization of storage assignment and PBWQ policy has the improvement of 19.64% in system performance compared with the baseline system which applies both classical storage assignment method and FCFS order processing policy

A Review of Modeling and Diagnostic Techniques for Eccentricity Fault in Electric Machines

Research on the modeling and fault diagnosis of rotor eccentricities has been conducted during the past two decades. A variety of diagnostic theories and methods have been proposed based on different mechanisms, and there are reviews following either one type of electric machines or one type of eccentricity. Nonetheless, the research routes of modeling and diagnosis are common, regardless of machine or eccentricity types. This article tends to review all the possible modeling and diagnostic approaches for all common types of electric machines with eccentricities and provide suggestions on future research roadmap. The paper indicates that a reliable low-cost non-intrusive real-time online visualized diagnostic method is the trend. Observer-based diagnostic strategies are thought promising for the continued research

Enhancing Model Performance in Multilingual Information Retrieval with Comprehensive Data Engineering Techniques

In this paper, we present our solution to the Multilingual Information Retrieval Across a Continuum of Languages (MIRACL) challenge of WSDM CUP 2023\footnote{https://project-miracl.github.io/}. Our solution focuses on enhancing the ranking stage, where we fine-tune pre-trained multilingual transformer-based models with MIRACL dataset. Our model improvement is mainly achieved through diverse data engineering techniques, including the collection of additional relevant training data, data augmentation, and negative sampling. Our fine-tuned model effectively determines the semantic relevance between queries and documents, resulting in a significant improvement in the efficiency of the multilingual information retrieval process. Finally, Our team is pleased to achieve remarkable results in this challenging competition, securing 2nd place in the Surprise-Languages track with a score of 0.835 and 3rd place in the Known-Languages track with an average nDCG@10 score of 0.716 across the 16 known languages on the final leaderboard

Dynamic motion of polar skyrmions in oxide heterostructures

Polar skyrmions have been widely investigated in oxide heterostructure recently, due to their exotic properties and intriguing physical insights. Meanwhile, so far, the external field-driven motion of the polar skyrmion, akin to the magnetic counterpart, has yet to be discovered. Here, using phase-field simulations, we demonstrate the dynamic motion of the polar skyrmions with integrated external thermal, electrical, and mechanical stimuli. The external heating reduces the spontaneous polarization hence the skyrmion motion barrier, while the skyrmions shrink under the electric field, which could weaken the lattice pinning and interactions between the skyrmions. The mechanical force transforms the skyrmions into c-domain in the vicinity of the indenter center under the electric field, providing the space and driving force needed for the skyrmions to move. This study confirmed that the skyrmions are quasi-particles that can move collectively, while also providing concrete guidance for the further design of polar skyrmion-based electronic devices.Comment: 17 pages, 4 figure

Steady-state topological order

We investigate a generalization of topological order from closed systems to open systems, for which the steady states take the place of ground states. We construct typical lattice models with steady-state topological order, and characterize them by complementary approaches based on topological degeneracy of steady states, topological entropy, and dissipative gauge theory. Whereas the (Liouvillian) level splitting between topologically degenerate steady states is exponentially small with respect to the system size, the Liouvillian gap between the steady states and the rest of the spectrum decays algebraically as the system size grows, and closes in the thermodynamic limit. It is shown that steady-state topological order remains definable in the presence of (Liouvillian) gapless modes. The topological phase transition to the trivial phase, where the topological degeneracy is lifted, is accompanied by gapping out the gapless modes. Our work offers a toolbox for investigating open-system topology of steady states.Comment: 33 pages, 17 figures. Joint submission with arXiv:2306.1248

Topologically Ordered Steady States in Open Quantum Systems

The interplay between dissipation and correlation can lead to new emergent phenomena. Here we study non-equilibrium phases of matter with robust topological degeneracy of steady states, which is a generalization of the ground-state topological degeneracy of closed systems. Specifically, we construct two representative Lindbladians using engineered dissipation, and exactly solve the steady states with topological degeneracy. We find that while the degeneracy is fragile under noise in two dimensions, it is stable in three dimensions, where a genuine many-body phase with topological degeneracy is realized. We identify universal features of dissipative topological physics such as the deconfined emergent gauge field and slow relaxation dynamics of topological defects. The transition from a topologically ordered phase to a trivial phase is also investigated via numerical simulation. Our work highlights the essential difference between ground-state topological order in closed systems and steady-state topological order in open systems.Comment: 6+9 pages, 3+2 figure

Polyhistor: Parameter-Efficient Multi-Task Adaptation for Dense Vision Tasks

Adapting large-scale pretrained models to various downstream tasks via fine-tuning is a standard method in machine learning. Recently, parameter-efficient fine-tuning methods show promise in adapting a pretrained model to different tasks while training only a few parameters. Despite their success, most existing methods are proposed in Natural Language Processing tasks with language Transformers, and adaptation to Computer Vision tasks with Vision Transformers remains under-explored, especially for dense vision tasks. Further, in multi-task settings, individually fine-tuning and storing separate models for different tasks is inefficient. In this work, we provide an extensive multi-task parameter-efficient benchmark and examine existing parameter-efficient fine-tuning NLP methods for vision tasks. Our results on four different dense vision tasks showed that existing methods cannot be efficiently integrated due to the hierarchical nature of the Hierarchical Vision Transformers. To overcome this issue, we propose Polyhistor and Polyhistor-Lite, consisting of Decomposed HyperNetworks and Layer-wise Scaling Kernels, to share information across different tasks with a few trainable parameters. This leads to favorable performance improvements against existing parameter-efficient methods while using fewer trainable parameters. Specifically, Polyhistor achieves competitive accuracy compared to the state-of-the-art while only using ~10% of their trainable parameters. Furthermore, our methods show larger performance gains when large networks and more pretraining data are used.Comment: Accepted to NeurIPS 2022; Project Page is at https://ycliu93.github.io/projects/polyhistor.htm